Technical Note—Solving Integer Programming Problems by Aggregating Constraints
نویسندگان
چکیده
منابع مشابه
Technical Report Integer Programming 1 Integer Programming 4
1 To appear as a chapter of the Handbook of Algorithms edited by M. Abstract Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture ...
متن کاملSolving Rummikub Problems by Integer Linear Programming
The Rummikub problem of finding the maximal number or value of the tiles that can be placed from your rack onto the table is very difficult, since the number of possible combinations are enormous. We show that this problem can be modeled as an integer linear programming problem. In this way solutions can be found in 1 s. We extend the model such that unnecessary changes of the existing sets on ...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملOn aggregating binary relations using 0-1 integer linear programming
This paper is concerned with the general problem of aggregating many binary relations in order to find out a consensus. The theoretical background we rely on is the Relational Analysis (RA) approach. The latter method represents binary relations (BRs) as adjacency matrices, models relational properties as linear equations and finds a consensus by maximizing a majoritybased criterion using 0-1 i...
متن کاملPlanning with Preferences and Trajectory Constraints by Integer Programming
We present an integer programming approach for handling preferences and trajectory constraints in planning. Our main aim is to illustrate through examples how simple it is to express preferences and trajectory constraints by linear constraints over 0-1 variables. We are currently in the process of incorporating these constraints in the context of efficient integer programming encodings that we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1977
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.25.2.346